-
1 graph method
метод графов
—
[Я.Н.Лугинский, М.С.Фези-Жилинская, Ю.С.Кабиров. Англо-русский словарь по электротехнике и электроэнергетике, Москва]Тематики
- электротехника, основные понятия
EN
Англо-русский словарь нормативно-технической терминологии > graph method
-
2 graph method
-
3 graph method
-
4 graph method
1) Техника: метод графов2) Экономика: графический метод -
5 graph method
мат. метод графов -
6 graph method
Англо-русский словарь по экономике и финансам > graph method
-
7 graph method
-
8 graph method
English-russian dctionary of contemporary Economics > graph method
-
9 graph method
метод графов, графовый метод -
10 graph method
English-Russian dictionary of computer science > graph method
-
11 bound-graph method
Англо-русский словарь нормативно-технической терминологии > bound-graph method
-
12 conflict graph method
Вычислительная техника: метод конфликтных графов -
13 flow graph method
Вычислительная техника: метод диаграмм прохождения сигналов, метод потоков -
14 line graph method
Телекоммуникации: способ рельефов -
15 scatter graph method
Бухгалтерия: метод графика рассеяния (применяется для разделения смешанных затрат на постоянную и переменную составляющие) -
16 line graph method
English-Russian dictionary of telecommunications and their abbreviations > line graph method
-
17 conflict graph method
English-Russian information technology > conflict graph method
-
18 flow graph method
метод потоков; метод диаграмм прохождения сигналов -
19 graph
1) график
2) строить график
3) диаграмма
4) одномерный комплекс
5) чертить диаграмму
6) граф
7) дерево
– alternating graph
– bar graph
– basin of graph
– bichromatic graph
– bunch graph
– complete graph
– connected graph
– construct graph
– construction of graph
– directed graph
– finite graph
– flat graph
– graph method
– graph paper
– graph theory
– infinite graph
– line graph
– logarithmic graph
– node of graph
– oriented graph
– parallax-correction graph
– schedule graph
– signal-flow graph
– signed graph
– singular graph
– specify graph
– state graph
– superposed graph
– tree graph
– two-dimensional graph
-
20 method
1) метод; приём; способ2) методика3) технология4) система•- accelerated strength testing method-
benching method-
bullhead well control method-
electrical-surveying method-
electromagnetic surveying method-
long-wire transmitter method-
operational method-
rule of thumb method-
straight flange method of rolling beams-
symbolical method-
tee-test method-
testing method-
triangulation method-
value-iteration method
См. также в других словарях:
Method of conditional probabilities — In mathematics and computer science, the probabilistic method is used to prove the existence of mathematical objects with desired combinatorial properties. The proofs are probabilistic they work by showing that a random object, chosen from some… … Wikipedia
Method of characteristics — In mathematics, the method of characteristics is a technique for solving partial differential equations. Typically, it applies to first order equations, although more generally the method of characteristics is valid for any hyperbolic partial… … Wikipedia
Graph automorphism — In graph theoretical mathematics, an automorphism of a graph is a form of symmetry in which the graph is mapped onto itself while preserving the edge vertex connectivity.Formally, an automorphism of a graph G = ( V , E ) is a permutation sigma;… … Wikipedia
Method of Four Russians — In computer science, the Method of Four Russians is a technique for speeding up algorithms involving Boolean matrices, or more generally algorithms involving matrices in which each cell may take on only a bounded number of possible values.… … Wikipedia
Median graph — The median of three vertices in a median graph In mathematics, and more specifically graph theory, a median graph is an undirected graph in which any three vertices a, b, and c have a unique median: a vertex m(a,b,c) that belongs to shortest… … Wikipedia
Decomposition method (constraint satisfaction) — In constraint satisfaction, a decomposition method translates a constraint satisfaction problem into another constraint satisfaction problem that is binary and acyclic. Decomposition methods work by grouping variables into sets, and solving a… … Wikipedia
Probabilistic method — This article is not about probabilistic algorithms, which give the right answer with high probability but not with certainty, nor about Monte Carlo methods, which are simulations relying on pseudo randomness. The probabilistic method is a… … Wikipedia
Clique (graph theory) — A graph with 23 1 vertex cliques (its vertices), 42 2 vertex cliques (its edges), 19 3 vertex cliques (the light blue triangles), and 2 4 vertex cliques (dark blue). Six of the edges and 11 of the triangles form maximal cliques. The two dark blue … Wikipedia
Schulze method — Part of the Politics series Electoral methods Single winner … Wikipedia
Discharging method (discrete mathematics) — The discharging method is a technique used to prove lemmas in structural graph theory. Discharging is most well known for its central role in the proof of the Four Color Theorem. The discharging method is used to prove that every graph in a… … Wikipedia
Clique percolation method — The clique percolation method[1] is a popular approach for analyzing the overlapping community structure of networks. The term network community (also called a module, cluster or cohesive group) has no widely accepted unique definition and it is… … Wikipedia